Sidon set systems

The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers

A set A of non-negative integers is called a Sidon set if all the sums a1+a2, with a1 ≤ a2 and a1, a2 ∈ A, are distinct. A well-known problem on Sidon sets is the determination of the maximum possible size F (n) of a Sidon subset of [n] = {0, 1, . . . , n− 1}. Results of Chowla, Erdős, Singer and Turán from the 1940s give that F (n) = (1 + o(1)) √ n. We study Sidon subsets of sparse random sets...

Generalized Sidon sets

We give asymptotic sharp estimates for the cardinality of a set of residue classes with the property that the representation function is bounded by a prescribed number. We then use this to obtain an analogous result for sets of integers, answering an old question of Simon Sidon. © 2010 Elsevier Inc. All rights reserved. MSC: 11B

Sumsets of Sidon sets

Arithmetic Characterizations of Sidon Sets

Let G be any discrete Abelian group. We give several arithmetic characterizations of Sidon sets in G. In particular, we show that a set A is a Sidon set iff there is a number 6 > 0 such that any finite subset A of A contains a subset B Q A with |B| > 6\A\ which is quasiindependent, i.e. such that the only relation of the form ]C\eB e x ^ = '̂ with e\ equal to + 1 or 0, is the trivial one. Let G ...

On Uniformly Approximable Sidon Sets

Let G be a compact abelian group and let T be the character group of G. Suppose £ is a subset of T. A trigonometric polynomial f on G is said to be an ^-polynomial if its Fourier transform / vanishes off E. The set E is said to be a Sidon set if there is a positive number B such that 2^xeb |/(X)| á-B||/||u for all E-polynomials /; here, ||/||„ = sup{ |/(x)| : xEG}. In this note we shall discuss...